Spatialized Normal Cone Hierarchies
نویسندگان
چکیده
We develop a data structure, the spatialized normal cone hierarchy, and apply it to interactive solutions for model silhouette extraction, local minimum distance computations, and area light source shadow umbra and penumbra boundary determination. The latter applications extend the domain of surface normal encapsulation from problems described by a point and a model to problems involving two models.
منابع مشابه
6-DOF Haptic Rendering Using Spatialized Normal Cone Search
This article describes a haptic rendering algorithm for arbitrary polygonal models using a six degree-offreedom haptic interface. The algorithm supports activities such as virtual prototyping of complex polygonal models and adding haptic interaction to virtual environments. The underlying collision system computes local extrema in distance between the model controlled by the haptic device and t...
متن کاملInteracting with Huge Hierarchies: Beyond Cone Trees
This paper describes an implementation of a tool for visualizing and interacting with huge information hierarchies, and some preliminary empirical evaluation of the tool’s efficacy. Existing systems for visualizing huge hierarchies using cone trees ‘‘break down” once the hierarchy to be displayed exceeds roughly 1000 nodes, due to increasing visual clutter. This paper describes a system called ...
متن کاملOn Optimality Conditions via Weak Subdifferential and Augmented Normal Cone
In this paper, we investigate relation between weak subdifferential and augmented normal cone. We define augmented normal cone via weak subdifferential and vice versa. The necessary conditions for the global maximum are also stated. We produce preliminary properties of augmented normal cones and discuss them via the distance function. Then we obtain the augmented normal cone for the indicator f...
متن کاملSymmetric Tensor Approximation Hierarchies for the Completely Positive Cone
In this paper we construct two approximation hierarchies for the completely positive cone based on symmetric tensors. We show that one hierarchy corresponds to dual cones of a known polyhedral approximation hierarchy for the copositive cone, and the other hierarchy corresponds to dual cones of a known semidefinite approximation hierarchy for the copositive cone. As an application, we consider a...
متن کاملOn the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
Abstract. In recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial optimization problems (POPs) have gained much popularity. At their heart, these hierarchies rely crucially on Positivstellensätze from the late 20th century (e.g., due to Stengle, Putinar, or Schmüdgen) that certify positivity of a polynomial on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000